A Tableaux-based Algorithm for Description Logics with Transitive Closure of Roles in Concept and Role Inclusion Axioms
نویسندگان
چکیده
In this paper, we investigate an extension of the description logic SHIQ––a knowledge representation formalism used for the Semantic Web––with transitive closure of roles occurring not only in concept inclusion axioms but also in role inclusion axioms. We start by proving that adding transitive closure of roles to SHIQ without restriction on role hierarchies may lead to undecidability. An analysis of this proof allows us to identify kinds of axioms which are responsible for the undecidability and to design a decidable extension of SHIQ with transitive closure of roles. Next, we propose a tableaux-based algorithm that decides satisfiability of the new logic. It was shown by experiments that this kind of algorithms is suitable for implementation.
منابع مشابه
A Tableaux-Based Algorithm for SHIQ with Transitive Closure of Roles in Concept and Role Inclusion Axioms
In this paper, we investigate an extension of the description logic SHIQ––a knowledge representation formalism used for the Semantic Web––with transitive closure of roles occurring not only in concept inclusion axioms but also in role inclusion axioms. It was proved that adding transitive closure of roles to SHIQ without restriction on role hierarchies may lead to undecidability. We have identi...
متن کاملDecidability of Description Logics with Transitive Closure of Roles in Concept and Role Inclusion Axioms
This paper investigates Description Logics which allow transitive closure of roles to occur not only in concept inclusion axioms but also in role inclusion axioms. First, we propose a decision procedure for the description logic SHIO+, which is obtained from SHIO by adding transitive closure of roles. Next, we show that SHIO+ has the finite model property by providing a upper bound on the size ...
متن کاملDecidability of SHI with Transitive Closure of Roles
This paper investigates a Description Logic, namely SHI+, which extends SHI by adding transitive closure of roles. The resulting logic SHI+ allows transitive closure of roles to occur not only in concept inclusion axioms but also in role inclusion axioms. We show that SHI+ is decidable by devising a terminating, sound and complete algorithm for deciding satisfiability of concepts in SHI+ with r...
متن کاملA Description Logic with Transitive and Inverse Roles and Role Hierarchies
The combination of transitive and inverse roles is important in a range of applications, and is crucial for the adequate representation of aggregated objects, allowing the simultaneous description of parts by means of the whole to which they belong and of wholes by means of their constituent parts. In this paper we present tableaux algorithms for deciding concept satisfiability and subsumption ...
متن کاملTerminating Tableaux for SOQ with Number Restrictions on Transitive Roles
We show that the description logic SOQ with number restrictions on transitive roles is decidable by a terminating tableau calculus. The language decided by the calculus includes the universal role, which allows us to internalize TBox axioms. Termination of the system is achieved through pattern-based blocking.
متن کامل